Microsoft Library
Subject: Soft state protocols and systems
Summary: This document contains citations and papers related to soft state protocols and systems. The first 19 papers resulted from a search using the terms provided in the original request – soft state or soft-state or soft state protcols and systems or distributed systems or networking. An analysis of these citations resulted in a number of additional terms for a second pass. These terms include telecommunication, refresh, RSVP, reservation, and resource sharing with soft state.
Title: MESH-R: large-scale, reliable multicast transport
Title: Tree multicast strategies in mobile, multihop wireless networks
Title: A model, analysis, and protocol framework for soft state-based communication
Title: YESSIR: a simple reservation mechanism for the Internet
Title: HAWAII: A domain-based approach for supporting mobility in wide-area wireless networks
Title: On providing quality-of-service control for core-based multicast routing
Title: Adaptive shared tree multicast in mobile wireless networks
Title: A network architecture for heterogeneous mobile computing
Title: Dynamic flow switching. A new communication service for ATM networks
Title: Active reliable multicast
Title: IP switching - ATM under IP
Title: Staged refresh timers for RSVP
Title: Cluster-based scalable network services
Title: Flow-based approach to datagram security
Title: Scalable timers for soft state protocols
Title: Shared tree wireless network multicast
Title: Flow labelled IP: a connectionless approach to ATM
Title: PIM architecture for wide-area multicast routing
Title: Robust regulation for a class of parameters uncertain nonlinear systems with minimum-phase
Title: A framework for provisioning of temporal QoS in core-based multicast routing
Title: An active network bandwidth reservation scheme
Title: New proposal for RSVP refreshes
Title: ATM, reservation and IP. ATM, RIP?
Title: QoS path management with RSVP
Title: Shared tree wireless network multicast
Title: RSVP: a new resource ReSerVation Protocol
First Pass
6459804 INSPEC Abstract Number: B2000-02-6150M-069, C2000-02-5640-061
Title: MESH-R: large-scale, reliable multicast transport
Author(s): Lucas, M.T.; Dempsey, B.J.; Weaver, A.C.
Author Affiliation: Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA
Conference Title: 1999 IEEE International Conference on Communications
(Cat. No. 99CH36311) Part vol.1 p.657-64 vol.1
Piscataway, NJ, USA
Publication Date: 1999 Country of Publication: USA 3 vol (xl+2061)
pp.
ISBN: 0 7803 5284 X Material Identity Number: XX-1999-01664
U.S. Copyright Clearance Center Code: 0 7803 5284 X/99/$10.00
Conference Title: 1999 IEEE International Conference on Communications
Conference Sponsor: AG Communication Systems; Lucent Technologies;
Transwitch; Nortel Networks; Sierra Wireless; BCTEL; IBM; Ericsson
Conference Date: 6-10 June 1999 Conference Location: Vancouver, BC,
Canada
Language: English Document Type: Conference Paper (PA)
Treatment: Applications (A); Practical (P); Experimental (X)
Abstract: This paper presents a novel multicast protocol, MESH-R, for
fully reliable data distribution in a scalable, efficient fashion. A key
contribution of our solution is the receiver-driven, dynamic organization
of the multicast control structure based on network performance
characteristics. The MESH-R framework (1) is a fully distributed,
transport-layer solution, (2) presents a robust state synchronization
protocol that provides detailed end-system state for reliability,
congestion control, group management, and other end-system services, and
(3) achieves an efficient, low-latency error control service using a
self-organizing, soft-state unicast recovery structure between multicast
receivers. In order to assess the relative performance and cost of our
solution in comparison to other approaches, MESH-R and three alternative
protocols are implemented in a high-fidelity WAN testbed, and their
performance and costs compared directly across a range of network
assumptions. The results highlight the robustness and agility of MESH-R
heuristics in adapting its error recovery and feedback message patterns to
dynamic network conditions, and MESH-R performs well relative to the other
protocols. The simulation study also uncovers some unexpected results
regarding the relative performance between the four protocol designs under
certain network scenarios. (12 Refs)
Copyright 2000, IEE
6444927 INSPEC Abstract Number: B2000-02-6210L-025, C2000-02-5620-016
Title: Tree multicast strategies in mobile, multihop wireless networks
Author(s): Gerla, M.; Ching-Chuan Chiang; Lixia Zhang
Author Affiliation: Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA
Journal: Mobile Networks and Applications vol.4, no.3 p.193-207
Publisher: Baltzer; ACM Press,
Publication Date: 1999 Country of Publication: Netherlands
CODEN: JSTAFL ISSN: 1383-469X
SICI: 1383-469X(1999)4:3L.193:TMSM;1-I
Material Identity Number: G269-1999-004
Language: English Document Type: Journal Paper (JP)
Treatment: Practical (P); Theoretical (T)
Abstract: Tree multicast is a well-established concept in wired networks.
Two versions, per-source tree multicast (e.g., DVMRP) and shared tree
multicast (e.g., core-based tree), account for the majority of the wireline
implementations. In this paper, we extend the tree multicast concept to
wireless, mobile, multihop networks for applications ranging from ad hoc
networking to disaster recovery and battlefield. The main challenge in
wireless, mobile networks is the rapidly changing environment. We address
this issue in our design by: (a) using "soft state"; (b) assigning
different roles to nodes depending on their mobility (2-level mobility
model); (c) proposing an adaptive scheme which combines shared tree and
per-source tree benefits; and (d) dynamically relocating the shared tree
rendezvous point (RP). A detailed wireless simulation model is used to
evaluate various multicast schemes. The results show that per-source trees
perform better in heavy loads because of the more efficient traffic
distribution, while shared trees are more robust to mobility and are more
scalable to large network sizes. The adaptive tree multicast scheme, a
hybrid between shared tree and per-source tree, combines the advantages of
both and performs consistently well across all load and mobility scenarios.
The main contributions of this study are: the use of a 2-level mobility
model to improve the stability of the shared tree; the development of a
hybrid, adaptive per-source and shared tree scheme; and the dynamic
relocation of the RP in the shared tree. (29 Refs)
Copyright 1999, IEE
6442730 INSPEC Abstract Number: B2000-02-6150M-002, C2000-02-5640-002
Title: A model, analysis, and protocol framework for soft state-based communication
Author(s): Raman, S.; McCanne, S.
Author Affiliation: Dept. of Electr. Eng. & Comput. Sci., California
Univ., Berkeley, CA, USA
Journal: Computer Communication Review Conference Title: Comput. Commun.
Rev. (USA) vol.29, no.4 p.15-25
Publisher: ACM,
Publication Date: Oct. 1999 Country of Publication: USA
CODEN: CCRED2 ISSN: 0146-4833
SICI: 0146-4833(199910)29:4L.15:MAPF;1-X
Material Identity Number: B579-1999-005
Conference Title: ACM SIGCOMM'99 Conference. Applications, Technologies,
Architectures, and Protocols for Computer Communications
Conference Sponsor: ACM
Conference Date: 30 Aug.-3 Sept. 1999 Conference Location: Cambridge,
MA, USA
Language: English Document Type: Conference Paper (PA); Journal Paper
(JP)
Treatment: Theoretical (T)
Abstract: "Soft state" is an often cited yet vague concept in network
protocol design in which two or more network entities intercommunicate in a
loosely coupled, often anonymous fashion. Researchers often define this
concept operationally (if at all) rather than analytically: a source of
soft state transmits periodic "refresh messages" over a (lossy)
communication channel to one or more receivers that maintain a copy of that
state, which in turn "expires" if the periodic updates cease. Though a
number of crucial Internet protocol building blocks are rooted in soft
state-based designs, controversy is building as to whether the performance
overhead of soft state refresh messages justifies their qualitative benefit
of enhanced system "robustness". We believe that this controversy has risen
not from fundamental performance tradeoffs but rather from our lack of a
comprehensive understanding of soft state. To better understand these
tradeoffs, we propose herein a formal model for soft state communication
based on a probabilistic delivery model with relaxed reliability. Using
this model, we conduct a queueing analysis and simulation to characterize
the data consistency and performance tradeoffs under a range of workloads
and network loss rates. We then extend our model with feedback and show,
through simulation, that adding feedback dramatically improves data
consistency (by up to 55%) without increasing network resource consumption.
Our model not only provides a foundation for understanding soft state, but
also induces a new fundamental transport protocol based on probabilistic
delivery. Toward this end, we sketch our design of the "soft state
transport protocol" (SSTP), which enjoys the robustness of soft state while
retaining the performance benefit of hard state protocols like TCP through
its judicious use of feedback. (53 Refs)
Copyright 1999, IEE
6308905 INSPEC Abstract Number: B1999-09-6150M-056, C1999-09-5640-036
Title: YESSIR: a simple reservation mechanism for the Internet
Author(s): Pan, P.; Schulzrinne, H.
Author Affiliation: AT&T Bell Labs., Holmdel, NJ, USA
Journal: Computer Communication Review vol.29, no.2 p.89-101
Publisher: ACM,
Publication Date: April 1999 Country of Publication: USA
CODEN: CCRED2 ISSN: 0146-4833
SICI: 0146-4833(199904)29:2L.89:YSRM;1-Q
Material Identity Number: B579-1999-003
Language: English Document Type: Journal Paper (JP)
Treatment: Practical (P)
Abstract: RSVP has been designed to support resource reservation in the
Internet. However, it has two major problems: complexity and scalability.
The former results in large message processing overhead at end systems and
routers, and inefficient firewall processing at the edge of the network.
The latter implies that in a backbone environment, the amount of bandwidth
consumed by refresh messages and the storage space that is needed to
support a large number of flows at a router are too large. We have
developed a new reservation mechanism that simplifies the process of
establishing reserved flows while preserving many unique features
introduced by RSVP. Simplicity is measured in terms of control message
processing, data packet processing, and user-level flexibility. Features
such as robustness, advertising network service availability and resource
sharing among multiple senders are also supported in the proposal. The
proposed mechanism, YESSIR (yet another sender session Internet
reservations) generates reservation requests by senders to reduce the
processing overhead, builds on top of RTCP, uses soft state to maintain
reservation states, supports shared reservation and associated flow merging
and is compatible with the IETF integrated services models. YESSIR extends
the all-or-nothing reservation model to support partial reservations that
improve over the duration of the session. To address the scalability issue,
we investigate the possibility of using YESSIR for per-stream reservation
and RSVP for aggregate reservation. (32 Refs)
Copyright 1999, IEE
05444650 E.I. No: EIP99124950579
Title: HAWAII: A domain-based approach for supporting mobility in wide-area wireless networks
Author: Ramjee, R.; La Porta, T.; Thuel, S.; Varadhan, K.; Wang, S.Y.
Corporate Source: Lucent Technologies, USA
Conference Title: Proceedings of the 1999 7th International Conference on
Network Protocols (ICNP'99)
Conference Location: Toronto, Can Conference Date: 19991031-19991103
Sponsor: IEEE Computer Society
E.I. Conference No.: 56111
Source: International Conference on Network Protocols 1999. p 283-292
Publication Year: 1999
CODEN: 85QDAI
Language: English
Document Type: JA; (Journal Article) Treatment: T; (Theoretical)
Journal Announcement: 0002W1
Abstract: Mobile IP is the current standard for supporting macro-mobility
of mobile hosts. However, in the case of micro-mobility support, there are
several competing proposals. In this paper, we present the design,
implementation, and performance evaluation of HAWAII: a domain-based
approach for supporting mobility. HAWAII uses specialized path setup
schemes which install host-based forwarding entries in specific routers to
support intra-domain micro-mobility. These path setup schemes deliver
excellent performance by reducing mobility related disruption to user
applications. Also, mobile hosts retain their network address while moving
within the domain, simplifying QoS support. Furthermore, reliability is
achieved through maintaining soft-state forwarding entries for the mobile
hosts and leveraging fault detection mechanisms built in existing
intra-domain routing protocols. HAWAII defaults to using Mobile IP for
macro-mobility, thus providing a comprehensive solution for mobility
support in wide-area wireless networks. (Author abstract) 13 Refs.
05392952 E.I. No: E2099104835252
Title: On providing quality-of-service control for core-based multicast routing
Author: Tyan, Hung-Ying; Hou, Jennifer; Wang, Bin
Corporate Source: Ohio State Univ, Columbus, OH, USA
Conference Title: Proceedings of the 1999 19th IEEE International
Conference on Distributed Computing Systems (ICDCS'99)
Conference Location: Austin, TX, USA Conference Date: 19990531-19990604
Sponsor: IEEE Computer Society
E.I. Conference No.: 55373
Source: Proceedings - International Conference on Distributed Computing
Systems 1999. p 25-33
Publication Year: 1999
CODEN: PICSEJ ISBN: 0-7695-0222-9
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications)
Journal Announcement: 9911W4
Abstract: In this paper, we develop efficient admission control tests for
member join/leave and its associated state refresh and update procedures
for receiver-initiated core-based multicast routing, e.g., Core Based Tree
(CBT) protocol, to allow construction of QoS-capable multicast trees, while
making the minimum possible impact to the existing infrastructure.
Specifically, we (i) derive sufficient conditions for a multicast tree to
maintain its QoS; (ii) devise effective admission tests to verify whether
or not a group member may join the multicast tree at adequate QoS, while
not violating existing QoS guarantees to other on-tree members; and (iii)
identify the minimum set of state information required for the admission
tests and develop a soft state refresh and update procedure. Finally, we
validate the effectiveness of the proposed mechanism by incorporating it
into the CBT protocol, and evaluate it via event-driven simulations in
terms of the probability of join requests being rejected, message overhead,
and scalability. (Author abstract) 12 Refs.
6409218 INSPEC Abstract Number: B1999-12-6250F-138
Title: Adaptive shared tree multicast in mobile wireless networks
Author(s): Ching-Chuan Chiang; Gerla, M.; Zhang, L.
Author Affiliation: Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA
Conference Title: IEEE GLOBECOM 1998 (Cat. NO. 98CH36250) Part vol.3
p.1817-22 vol.3
Publisher: IEEE, Piscataway, NJ, USA
Publication Date: 1998 Country of Publication: USA 6 vol.
(lxxii+lii+3773) pp.
ISBN: 0 7803 4984 9 Material Identity Number: XX-1999-01287
U.S. Copyright Clearance Center Code: 0 7803 4984 9/99/$10.00
Conference Title: IEEE GLOBECOM 1998
Conference Sponsor: IEEE; IEEE Commun. Soc.; ICC GLOBECOM
Conference Date: 8-12 Nov. 1998 Conference Location:
Sydney,NSW,Australia
Language: English Document Type: Conference Paper (PA)
Treatment: Theoretical (T)
Abstract: Shared tree multicast is a well established concept used in
several multicast protocols for wireline networks (e.g. core base tree, PIM
sparse mode etc). In this paper, we extend the shared tree concept to
wireless, mobile, multihop networks for applications ranging from ad hoc
networking to disaster recovery and battlefield. The main challenge in
wireless, mobile networks is the rapidly changing environment. We address
this issue in our design by: (a) using "soft state"; (b) assigning
different roles to nodes depending on their mobility (two level mobility
model); (c) proposing an adaptive scheme which combines shared tree and
source tree benefits. A detailed wireless simulation model is used to
evaluate the proposed schemes and compare them with source based tree (as
opposed to shared tree) multicast. The results show that shared tree
protocols have low overhead and are very robust to mobility. (13 Refs)
Copyright 1999, IEE
6077298 INSPEC Abstract Number: B9812-6250F-141, C9812-5620W-046
Title: A network architecture for heterogeneous mobile computing
Author(s): Brewer, E.A.; Katz, R.H.; Chawathe, Y.; Gribble, S.D.; Hodes,
T.; Giao Nguyen; Stemm, M.; Henderson, T.; Amir, E.; Balakrishnan, H.; Fox,
A.; Padmanabhan, V.N.; Seshan, S.
Author Affiliation: California Univ., Berkeley, CA, USA
Journal: IEEE Personal Communications vol.5, no.5 p.8-24
Publisher: IEEE,
Publication Date: Oct. 1998 Country of Publication: USA
CODEN: IPCME7 ISSN: 1070-9916
SICI: 1070-9916(199810)5:5L.8:NAHM;1-9
Material Identity Number: B467-98006
U.S. Copyright Clearance Center Code: 1070-9916/98/$10.00
Language: English Document Type: Journal Paper (JP)
Treatment: Applications (A); Practical (P); Experimental (X)
Abstract: This article summarizes the results of the BARWAN project,
which focused on enabling truly useful mobile networking across an
extremely wide variety of real-world networks and mobile devices. We
present the overall architecture, summarize key results, and discuss four
broad lessons learned along the way. The architecture enables seamless
roaming in a single logical overlay network composed of many heterogeneous
(mostly wireless) physical networks, and provides significantly better TCP
performance for these networks. It also provides complex scalable and
highly available services to enable powerful capabilities across a very
wide range of mobile devices, and mechanisms for automated discovery and
configuration of localized services. Four broad themes arose from the
project: (1) the power of dynamic adaptation as a generic solution to
heterogeneity, (2) the importance of cross-layer information, such as the
exploitation of TCP semantics in the link layer, (3) the use of agents in
the infrastructure to enable new abilities and to hide new problems from
legacy servers and protocol stacks, and (4) the importance of soft state
for such agents for simplicity, ease of fault recovery, and scalability. (
44 Refs)
Copyright 1998, IEE
6010807 INSPEC Abstract Number: B9810-6150C-033, C9810-5620W-041
Title: Dynamic flow switching. A new communication service for ATM networks
Author(s): Qiyong Bian; Shiomoto, K.; Turner, J.
Conference Title: Proceedings. IEEE INFOCOM '98, the Conference on
Computer Communications. Seventeenth Annual Joint Conference of the IEEE
Computer and Communications Societies. Gateway to the 21st Century (Cat.
No.98CH36169) Part vol.3 p.955-63 vol.3
Publisher: IEEE, New York, NY, USA
Publication Date: 1998 Country of Publication: USA 3 vol. xxviii+1477
pp.
ISBN: 0 7803 4383 2 Material Identity Number: XX98-00852
U.S. Copyright Clearance Center Code: 0 7803 4383 2/98/$10.00
Conference Title: Proceedings IEEE INFOCOM'98 Conference on Computer
Communications Seventeenth Annual Joint Conference of the IEEE Computer and
Communications Societies Gateway to the 21st Century
Conference Sponsor: IEEE Comput. Soc.; IEEE Commun. Soc
Conference Date: 29 March-2 April 1998 Conference Location: San
Francisco, CA, USA
Language: English Document Type: Conference Paper (PA)
Treatment: Theoretical (T)
Abstract: This paper presents a new communication service for ATM
networks that provides one-way, adjustable rate, on-demand communication
channels. The proposed dynamic flow service is designed to operate within a
multi-service cell switched network that supports both conventional
switched virtual circuits and IP packet routing and is designed to
complement those services. It is particularly well suited to applications
that transmit substantial amounts of data (a few tens of kilobytes or more)
in fairly short time periods (up to a few seconds). Much of the current
World-Wide Web traffic falls within this domain. Like IP packet networks,
the new service permits the transmission of data without prior end-to-end
connection establishment. It uses a variant of ATM resource management
cells to carry dynamic flow setup information along with the data,
including an IP destination address and burst transmission rate. Switches
along the path select next an outgoing link dynamically using the burst
rate to guide the routing decision. The dynamic flow setup protocol is
based on soft-state control and is designed to facilitate the use of
buffers that are shared across all ports of a switch, minimizing per port
memory costs. (11 Refs)
Copyright 1998, IEE
05020352 E.I. No: EIP98054212285
Title: Active reliable multicast
Author: Lehman, Li-wei H.; Garland, Stephen J.; Tennenhouse, David L.
Corporate Source: MIT Lab for Computer Science
Conference Title: Proceedings of the 1998 17th Annual IEEE Conference on
Computer Communications, INFOCOM. Part 2 (of 3)
Conference Location: San Francisco, CA, USA Conference Date:
19980329-19980402
Sponsor: IEEE
E.I. Conference No.: 48335
Source: Proceedings - IEEE INFOCOM v 2 1998. IEEE, Piscataway, NJ,
USA,98CH36169. p 581-589
Publication Year: 1998
CODEN: PINFEZ ISSN: 0743-166X
Language: English
Document Type: CA; (Conference Article) Treatment: T; (Theoretical)
Journal Announcement: 9807W3
Abstract: This paper presents a novel loss recovery scheme, Active
Reliable Multicast (ARM), for large-scale reliable multicast. ARM is
'active' in that routers in the multicast tree play an active role in loss
recovery. Additionally, ARM utilizes soft-state storage within the network
to improve performance and scalability. In the upstream direction, routers
suppress duplicate NACKs from multiple receivers to control the implosion
problem. By suppressing duplicate NACKs, ARM also lessens the traffic that
propagates back through the network. In the downstream direction, routers
limit the delivery of repair packets to receivers experiencing loss,
thereby reducing network bandwidth consumption. Finally, to reduce
wide-area recovery latency and to distribute the retransmission load,
routers cache multicast data on a 'best-effort' basis. ARM is flexible and
robust in that it does not require all nodes to be active, nor does it
require any specific router or receiver to perform loss recovery. Analysis
and simulation results show that ARM yields significant benefits even when
less than half the routers within the multicast tree can perform ARM
processing. (Author abstract) 14 Refs.
05003834 E.I. No: EIP98054179216
Title: IP switching - ATM under IP
Author: Newman, Peter; Minshall, Greg; Lyon, Thomas L.
Corporate Source: Ipsilon Networks, Sunnyvale, CA, USA
Source: IEEE/ACM Transactions on Networking v 6 n 2 Apr 1998. p 117-129
Publication Year: 1998
CODEN: IEANEP ISSN: 1063-6692
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); G;
(General Review)
Journal Announcement: 9806W4
Abstract: Internet protocol (IP) traffic on the Internet and private
enterprise networks has been growing exponentially for some time. This
growth is beginning to stress the traditional processor-based design of
current-day routers. Switching technology offers much higher aggregate
bandwidth, but presently only offers a layer-2 bridging solution. Various
proposals are under way to support IP routing over an asynchronous transfer
mode (ATM) network. However, these proposals hide the real network topology
from the IP layer by treating the data-link layer as a large opaque network
cloud. We argue that this leads to complexity, inefficiency, and
duplication of functionality in the resulting network. We propose an
alternative in which we discard the end-to-end ATM connection and integrate
fast ATM hardware directly with IP, preserving the connectionless nature of
IP. We use soft-state in the ATM hardware to cache the IP forwarding
decision. This enables further traffic on the same IP flow to be switched
by the ATM hardware rather than forwarded by IP software. We claim that
this approach combines the simplicity, scalability, and robustness of IP
with the speed, capacity, and multiservice traffic capabilities of ATM.
(Author abstract) 43 Refs.
5938843 INSPEC Abstract Number: B9807-6150M-064, C9807-5640-050
Title: Staged refresh timers for RSVP
Author(s): Ping Pan; Schulzrinne, H.
Author Affiliation: IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA
Conference Title: GLOBECOM 97. IEEE Global Telecommunications Conference.
Conference Record (Cat. No.97CH36125) Part vol.3 p.1909-13 vol.3
Publisher: IEEE, New York, NY, USA
Publication Date: 1997 Country of Publication: USA 3 vol. xxvii+1962
pp.
ISBN: 0 7803 4198 8 Material Identity Number: XX97-02850
U.S. Copyright Clearance Center Code: 0 7803 4198 8/97/$10.00
Conference Title: GLOBECOM 97. IEEE Global Telecommunications Conference.
Conference Record
Conference Sponsor: Bull Worldwide Inf. Syst
Conference Date: 3-8 Nov. 1997 Conference Location: Phoenix, AZ, USA
Language: English Document Type: Conference Paper (PA)
Treatment: Theoretical (T)
Abstract: The current resource reservation protocol (RSVP) design has no
reliability mechanism for the delivery of control messages. Instead, RSVP
relies on periodic refresh between routers to maintain reservation states.
This approach has several problems in a congested network. End systems send
PATH and RESV messages to set up RSVP connections. If the first PATH or
RESV message from an end system is accidentally lost in the network, a copy
of the message will not be retransmitted until the end of a refresh
interval, causing a delay of 30 seconds or more until a reservation is
established. If a congested link reuses a tear-down message (PATHTEAR or
RESVTEAR) to be dropped, the corresponding reservation will not be removed
from the routers until the RSVP cleanup timer expires. We present an RSVP
enhancement called staged refresh timers to support fast and reliable
message delivery that ensures hop-by-hop delivery of control messages
without violating the soft-state design. The enhancement is
backwards-compatible and can be easily added to current implementations.
The new approach can speed up the delivery of trigger messages while
reducing the amount of refresh messages. The approach is also applicable to
other soft-state protocols. (9 Refs)
Copyright 1998, IEE
5820847 INSPEC Abstract Number: C9803-6150N-034
Title: Cluster-based scalable network services
Author(s): Fox, A.; Gribble, S.D.; Chawathe, Y.; Brewer, E.A.; Gauthier, P.
Author Affiliation: California Univ., Berkeley, CA, USA
Journal: Operating Systems Review Conference Title: Oper. Syst. Rev.
(USA) vol.31, no.5 p.78-91
Publisher: ACM,
Publication Date: Dec. 1997 Country of Publication: USA
CODEN: OSRED8 ISSN: 0163-5980
SICI: 0163-5980(199712)31:5L.78:CBSN;1-A
Material Identity Number: O043-98001
U.S. Copyright Clearance Center Code: 0 89791 916 5/97/0010..$3.50
Conference Title: 16th ACM Symposium on Operating Systems Principles
Conference Sponsor: ACM
Conference Date: 5-8 Oct. 1997 Conference Location: Saint Malo, France
Language: English Document Type: Conference Paper (PA); Journal Paper
(JP)
Treatment: Bibliography (B); Practical (P)
Abstract: We identify three fundamental requirements for scalable network
services: incremental scalability and overflow growth provisioning; 24*7
availability through fault masking; and cost-effectiveness. We argue that
clusters of commodity workstations interconnected by a high-speed SAN are
exceptionally well-suited to meeting these challenges for Internet server
workloads, provided the software infrastructure for managing partial
failures and administering a large cluster does not have to be reinvented
for each new service. To this end we propose a general, layered
architecture for building cluster-based scalable network services that
encapsulates the above requirements for reuse, and a service-programming
model based on composable workers that perform transformation, aggregation
caching, and customization (TACC) of Internet content. For both performance
and implementation simplicity, the architecture and TACC programming model
exploit BASE, a weaker-than-ACID data semantics that results from trading
consistency for availability and relying on soft state for robustness in
failure management. Our architecture can be used as an off the shelf
infrastructural platform for creating new network services, allowing
authors to focus on the content of the service (by composing TACC building
blocks) rather than its implementation. We discuss two real implementations
of services based on this architecture: TranSend, a Web distillation proxy
deployed to the UC Berkeley dialup IP population; and HotBot, the
commercial implementation of the Inktomi search engine. (67 Refs)
Copyright 1998, IEE
04914083 E.I. No: EIP98014026305
Title: Flow-based approach to datagram security
Author: Mittra, Suvo; Woo, Thomas Y.C.
Corporate Source: Stanford Univ, Stanford, CA, USA
Conference Title: Proceedings of the 1997 ACM SIGCOMM Conference on
Applications, Technologies, Architectures, and Protocols for Computer
Communication
Conference Location: Cannes, Fr Conference Date: 19970914-19970918
E.I. Conference No.: 47675
Source: Computer Communication Review v 27 n 4 Oct 1997. p 221-234
Publication Year: 1997
CODEN: CCRED2 ISSN: 0146-4833
Language: English
Document Type: JA; (Journal Article) Treatment: T; (Theoretical)
Journal Announcement: 9803W3
Abstract: Datagram services provide a simple, flexible, robust, and
scalable communication abstraction; their usefulness has been well
demonstrated by the success of IP, UDP, and RPC. Yet, the overwhelming
majority of network security protocols that have been proposed are geared
towards connection-oriented communications. The few that do cater to
datagram communications tend to either rely on long term host-pair keying
or impose a session-oriented (i.e., requiring connection setup) semantics.
Separately, the concept of flows has received a great deal of attention
recently, especially in the context of routing and QoS. A flow
characterizes a sequence of datagrams sharing some pre-defined attributes.
In this paper, we advocate the use of flows as a basis for structuring
secure datagram communications. We support this by proposing a novel
protocol for datagram security based on flows. Our protocol achieves
zero-message keying, thus preserving the connectionless nature of datagram,
and makes use of soft state, thus providing the per-packet processing
efficiency of session-oriented schemes. We have implemented an
instantiation for IP in the 4.4BSD kernel, and we provide a description of
our implementation along with performance results. (Author abstract) 29
Refs.
04905582 E.I. No: EIP98014001372
Title: Scalable timers for soft state protocols
Author: Sharma, Puneet; Estrin, Deborah; Floyd, Sally; Jacobson, Van
Corporate Source: Univ of Southern California, CA, USA
Conference Title: Proceedings of the 1997 16th IEEE Annual Conference on
Computer Communications, INFOCOM. Part 1 (of 3)
Conference Location: Kobe, Jpn Conference Date: 19970407-19970412
Sponsor: IEEE
E.I. Conference No.: 47574
Source: Proceedings - IEEE INFOCOM v 1 1997. IEEE, Piscataway, NJ,
USA,97CB36034. p 222-229
Publication Year: 1997
CODEN: PINFEZ ISSN: 0743-166X
Language: English
Document Type: CA; (Conference Article) Treatment: T; (Theoretical)
Journal Announcement: 9803W1
Abstract: Soft state protocols use periodic refresh messages to keep
network state alive while adapting to changing network conditions; this has
raised concerns regarding the scalability of protocols that use the
soft-state approach. In existing soft state protocols, the values of the
timers that control the sending of these messages, and the timers for aging
out state, are chosen by matching empirical observations with desired
recovery and response times. These fixed timer-values fail because they use
time as a metric for bandwidth; they adapt neither to (1) the wide range of
link speeds that exist in most wide-area internets, nor to (2) fluctuations
in the amount of network state over time. We propose and evaluate a new
approach in which timer-values adapt dynamically, to the volume of control
traffic and available bandwidth on the link. The essential mechanisms
required to realize this scalable timers approach are: (1) dynamic
adjustment of the senders' refresh rate so that the bandwidth allocated for
control traffic is not exceeded, and (2) estimation of the senders' refresh
rate at the receiver in order to determine when the state can be timed-out
and deleted. The refresh messages are sent in a round robin manner not
exceeding the bandwidth allocated to control traffic, and taking into
account message priorities. We evaluate two receiver estimation methods for
dynamically adjusting network state timeout values: (1) counting of the
rounds and (2) exponential weighted moving average. (Author abstract) 15
Refs.
04872101 E.I. No: EIP97113935200
Title: Shared tree wireless network multicast
Author: Chiang, Ching-Chuan; Gerla, Mario; Zhang, Lixia
Corporate Source: Univ of California, Los Angeles, CA, USA
Conference Title: Proceedings of the 1997 6th International Conference on
Computer Communications and Networks, ICCCN'97
Conference Location: Las Vegas, NV, USA Conference Date:
19970922-19970925
Sponsor: IEEE
E.I. Conference No.: 47285
Source: Proceedings of the International Conference on Computer
Communications and Networks, ICCCN 1997. IEEE, Piscataway, NJ,
USA,97TB100187. p 28-33
Publication Year: 1997
CODEN: 002473
Language: English
Document Type: CA; (Conference Article) Treatment: T; (Theoretical)
Journal Announcement: 9801W2
Abstract: In this paper, we propose a multicast protocol for a multihop,
mobile wireless network with cluster based routing and token access
protocol within each cluster. The multi-cast protocol uses a shared tree
which is dynamically updated to adjust to changes in topology and
membership (i.e. dynamic joins and quits). Two options for tree maintenance
have been simulated and evaluated: `hard state' (i.e. each connection must
be explicitly cleared) and `soft state' (each connection is automatically
timed out and must be refreshed). For the soft state policy, the
performance of different choices of timeout and refresh timers is first
analyzed for a range of node mobility values. Next, soft state and hard
state policies are compared based on throughput, join delay, and control
overhead criteria. (Author abstract) 15 Refs.
5341605 INSPEC Abstract Number: B9609-6210L-151, C9609-5620L-052
Title: Flow labelled IP: a connectionless approach to ATM
Author(s): Newman, P.; Lyon, T.; Minshall, G.
Conference Title: Proceedings IEEE INFOCOM '96. The Conference on
Computer Communications. Fifteenth Annual Joint Conference of the IEEE
Computer Societies. Networking the Next Generation (Cat. No.96CB35887)
Part vol.3 p.1251-60 vol.3
Publisher: IEEE Comput. Soc. Press, Los Alamitos, CA, USA
Publication Date: 1996 Country of Publication: USA 3 vol. xxvi+1487
pp.
ISBN: 0 8186 7293 5 Material Identity Number: XX96-01147
U.S. Copyright Clearance Center Code: 0743-166X/96/$5.00
Conference Title: Proceedings of IEEE INFOCOM '96. Conference on Computer
Communications
Conference Sponsor: IEEE Comput. Soc.; IEEE Commun. Soc
Conference Date: 24-28 March 1996 Conference Location: San Francisco,
CA, USA
Language: English Document Type: Conference Paper (PA)
Treatment: Applications (A); Practical (P); Experimental (X)
Abstract: A number of proposals for supporting the Internet protocol (IP)
over ATM are under discussion in the networking community including: LAN
emulation, classical IP over ATM, routing over large clouds, and
multiprotocol over ATM. Each of these proposals hides the real network
topology from the IP layer by treating the data link layer as a large,
opaque, network cloud. We argue that this leads to complexity, inefficiency
and duplication of functionality in the resulting network. We propose an
alternative in which we discard the connection oriented nature of ATM and
integrate fast ATM hardware directly with the IP, presenting the
connectionless nature of the IP. We use a "soft" state in the ATM hardware
to cache the IP forwarding decision. This enables further traffic on the
same IP flow to be switched by the ATM hardware rather than forwarded by
the IP software. We claim that this approach combines the simplicity,
scalability, and robustness of the IP with the speed, capacity, and
multiservice traffic capabilities of ATM. (25 Refs)
Copyright 1996, IEE
04395800 E.I. No: EIP96053161520
Title: PIM architecture for wide-area multicast routing
Author: Deering, Stephen; Estrin, Deborah L.; Farinacci, Dino; Jacobson,
Van; Liu, Ching-Gung; Wei, Liming
Corporate Source: Xerox PARC, Palo Alto, CA, USA
Source: IEEE/ACM Transactions on Networking v 4 n 2 Apr 1996. p 153-162
Publication Year: 1996
CODEN: IEANEP ISSN: 1063-6692
Language: English
Document Type: JA; (Journal Article) Treatment: T; (Theoretical)
Journal Announcement: 9606W5
Abstract: The purpose of multicast routing is to reduce the communication
costs for applications that send the same data to multiple recipients.
Existing multicast routing mechanisms were intended for use within regions
where a group is widely represented or bandwidth is universally plentiful.
When group members, and senders to those group members, are distributed
sparsely across a wide area, these schemes are not efficient; data packets
or membership report information are occasionally sent over many links that
do not lead to receivers or senders, respectively. We have developed a
multicast routing architecture that efficiently establishes distribution
trees across wide area internets, where many groups will be sparsely
represented. Efficiency is measured in terms of the router state, control
message processing, and data packet processing, required across the entire
network in order to deliver data packets to the members of the group. Our
protocol independent multicast (PIM) architecture: a) maintains the
traditional IP multicast service model of receiver-initiated membership, b)
supports both shared and source-specific (shortest-path) distribution
trees, c) is not dependent on a specific unicast routing protocol, and d)
uses soft-state mechanisms to adapt to underlying network conditions and
group dynamics. The robustness, flexibility, and scaling properties of this
architecture make it well-suited to large heterogeneous internetworks.
(Author abstract) 36 Refs.
5189880 INSPEC Abstract Number: C9603-1340K-104
Title: Robust regulation for a class of parameters uncertain nonlinear systems with minimum-phase
Author(s): Souyin Li; Liu Xiaoping
Author Affiliation: Dept. of Autom. Control, Northeastern Univ.,
Shenyang, China
Conference Title: Proceedings of the 34th IEEE Conference on Decision and
Control (Cat. No.95CH35803) Part vol.4 p.3953-4 vol.4
Publisher: IEEE, New York, NY, USA
Publication Date: 1995 Country of Publication: USA 4 vol. 4385 pp.
ISBN: 0 7803 2685 7 Material Identity Number: XX96-00028
U.S. Copyright Clearance Center Code: 0 7803 2685 7/95/$4.00
Conference Title: Proceedings of 1995 34th IEEE Conference on Decision
and Control
Conference Sponsor: IEEE Control Syst. Soc
Conference Date: 13-15 Dec. 1995 Conference Location: New Orleans, LA,
USA
Language: English Document Type: Conference Paper (PA)
Treatment: Theoretical (T)
Abstract: In this paper we consider the robust regulation problems of
minimum-phase nonlinear systems with the time-varying parameter
uncertainties which enter linearly. It is shown that if the undisturbed
system has the minimum-phase, parameters or disturbances are in a (unknown)
compact set, and the generalised triangularity condition holds, then there
exists a "softer" state feedback controller with observer, motivated by
Freeman and Kobotovic (1993), than backstepping design used by Marino and
Tomei (1993), which regulates each uncertain system in the family. (5
Refs)
Copyright 1996, IEE
Second Pass
6461625 INSPEC Abstract Number: B2000-02-6150P-028, C2000-02-6150N-122
Title: A framework for provisioning of temporal QoS in core-based multicast routing
Author(s): Tyan, H.-Y.; Hou, C.-J.; Wang, B.
Author Affiliation: Dept. of Electr. Eng., Ohio State Univ., Columbus,
OH, USA
Conference Title: Proceedings 20th IEEE Real-Time Systems Symposium (Cat.
No.99CB37054) p.168-78
Publisher: IEEE Comput. Soc, Los Alamitos, CA, USA
Publication Date: 1999 Country of Publication: USA xiii+372 pp.
ISBN: 0 7695 0475 2 Material Identity Number: XX-1999-03554
U.S. Copyright Clearance Center Code: 0 7695 0475 2/99/$10.00
Conference Title: Proceedings 20th IEEE Real-Time Systems. Symposium
Conference Sponsor: IEEE Comput. Soc. Tech. Committee on Real-Time Syst.;
Microsoft Corp.; Office of Naval Res
Conference Date: 1-3 Dec. 1999 Conference Location: Phoenix, AZ, USA
Medium: Also available on CD-ROM in PDF format
Language: English Document Type: Conference Paper (PA)
Treatment: Practical (P)
Abstract: We develop and evaluate a set of member join/leave and state
update/refresh procedures for QoS provisioning in core-based multicast
routing with explicit member join and soft state refresh procedures.
Specifically, in our prior work (Hung-Ying Tyan et al., 1999), we devised
eligibility tests to verify whether or not a new member can join a
multicast tree at adequate QoS while not violating the existing QoS
guarantees to other on-tree members. We extend our prior work, identify the
tradeoff between the amount of state kept at each on-tree router and the
degree of collaboration among on-tree routers to conduct the tests, and
develop two member join/leave procedures that range from using the most
comprehensive state update procedure (and hence the least degree of
collaboration among on-tree routers) to the other extreme. Also, we
evaluate the proposed framework, in terms of the probability of locating
feasible multicast trees, message overheads, and scalability. (18 Refs)
Copyright 2000, IEE
6240705 INSPEC Abstract Number: B1999-06-6210C-023, C1999-06-5620-033
Title: An active network bandwidth reservation scheme
Author(s): Williams, D.; Chi Nguyen; Fekete, A.; Hitchens, M.;
Kummerfeld, B.
Author Affiliation: Dept. of Comput. Sci., Sydney Univ., NSW, Australia
Conference Title: 1999 IEEE Second Conference on Open Architectures and
Network Programming. Proceedings. OPENARCH '99 (Cat. No.99EX252) p.59-66
Publisher: IEEE, Piscataway, NJ, USA
Publication Date: 1999 Country of Publication: USA v+129 pp.
ISBN: 0 7803 5261 0 Material Identity Number: XX-1999-00875
U.S. Copyright Clearance Center Code: 0 7803 5261 0/99/$10.00
Conference Title: Proceedings of 2nd Conference on Open Architectures and
Network Programming
Conference Date: 26-27 March 1999 Conference Location: New York, NY,
USA
Language: English Document Type: Conference Paper (PA)
Treatment: Practical (P)
Abstract: This paper describes a novel scheme for ensuring quality of
service in a dynamically extensible active network. Applications can
reserve bandwidth on each link, and the node provides the guaranteed amount
by manipulating weights in a fair-sharing scheme. The reservations are
represented as objects in the soft state at each node of the network. We
demonstrate the versatility of this scheme by showing how to design an
active protocol that seeks to reserve end-to-end bandwidth even when no
single path can provide enough for its needs. (10 Refs)
Copyright 1999, IEE
05444638 E.I. No: EIP99124950567
Title: New proposal for RSVP refreshes
Author: Wang, Lan; Terzis, Andreas; Zhang, Lixia
Corporate Source: Univ of California, Los Angeles, Los Angeles, CA, USA
Conference Title: Proceedings of the 1999 7th International Conference on
Network Protocols (ICNP'99)
Conference Location: Toronto, Can Conference Date: 19991031-19991103
Sponsor: IEEE Computer Society
E.I. Conference No.: 56111
Source: International Conference on Network Protocols 1999. p 163-172
Publication Year: 1999
CODEN: 85QDAI
Language: English
Document Type: JA; (Journal Article) Treatment: G; (General Review)
Journal Announcement: 0002W1
Abstract: As a soft-state protocol, RSVP specifies that each RSVP node
sends periodic control messages to maintain the state for active RSVP
sessions. The protocol overhead due to such periodic messages grows
linearly with the number of RSVP sessions. One may reduce the overhead by
using a longer refresh period, which unfortunately leads to longer delays
in re-synchronizing RSVP state. In this paper we introduce a novel
`state-compression' approach to reducing the overhead of periodic
refreshes. Instead of per session refresh messages, an RSVP node sends
periodically to each of its neighbor node a Digest message that contains a
compressed version of the entire RSVP state shared with that particular
neighbor. In order to speed up state synchronization in face of message
losses we also enhance RSVP with an acknowledgment mechanism. Our
mechanisms achieve a constant message transmission overhead and low delay
while retaining the soft-state nature of the RSVP protocol. (Author
abstract) 8 Refs.
6409176 INSPEC Abstract Number: B1999-12-6210R-060, C1999-12-7410F-091
Title: An object oriented toolkit for implementation oriented modeling of real-time multimedia communications
Author(s): Venkataram, P.; Kumar, S.; Singha, S.
Author Affiliation: Dept. of Electr. Commun. Eng., Indian Inst. of Sci.,
Bangalore, India
Conference Title: IEEE GLOBECOM 1998 (Cat. NO. 98CH36250) Part vol.3
p.1556-61 vol.3
Publisher: IEEE, Piscataway, NJ, USA
Publication Date: 1998 Country of Publication: USA 6 vol.
(lxxii+lii+3773) pp.
ISBN: 0 7803 4984 9 Material Identity Number: XX-1999-01287
U.S. Copyright Clearance Center Code: 0 7803 4984 9/99/$10.00
Conference Title: IEEE GLOBECOM 1998
Conference Sponsor: IEEE; IEEE Commun. Soc.; ICC GLOBECOM
Conference Date: 8-12 Nov. 1998 Conference Location:
Sydney,NSW,Australia
Language: English Document Type: Conference Paper (PA)
Treatment: Applications (A); New Developments (N); Practical (P);
Experimental (X)
Abstract: A comparative performance evaluation of network protocols and
architectures necessitates theoretically evaluating and experimentally
comparing the different architectures, protocols, topologies and
technologies of the networks under the same operating conditions. A toolkit
providing this facility may therefore be of great importance. In this paper
a framework of traffic control to accommodate multimedia connections in a
network is proposed. An approach based on the resource reservation protocol
is implemented to reserve resources. It follows many novel design
principles such as receiver initiated reservation, separating reservation
from packet filtering, maintaining soft states in the network and
modularity. (10 Refs)
Copyright 1999, IEE
6076106 INSPEC Abstract Number: B9812-6150M-052, C9812-5640-050
Title: ATM, reservation and IP. ATM, RIP?
Author(s): Shepherd, D.
Author Affiliation: Dept. of Comput., Lancaster Univ., UK
Conference Title: Interactive Distributed Multimedia Systems and
Telecommunication Services. 5th International Workshop, IDMS '98.
Proceedings p.1
Editor(s): Plagemann, T.; Goebel, V.
Publisher: Springer-Verlag, Berlin, Germany
Publication Date: 1998 Country of Publication: Germany xv+326 pp.
ISBN: 3 540 64955 7 Material Identity Number: XX98-02124
Conference Title: Proceedings of 5th International Workshop on
Interactive Distributed Multimedia Systems and Telecommunication Service
Conference Date: 8-11 Sept. 1998 Conference Location: Oslo, Norway
Language: English Document Type: Conference Paper (PA)
Treatment: General, Review (G)
Abstract: Summary form only given. Recent advances within IP have raised
significant questions over the future of ATM. The only major advantage of
ATM has been its ability to handle streamed multimedia traffic, however,
even in this role ATM has been seen as too heavyweight; the simple AAL
(AAL5) has won the day, but this is little more than an admission that IP,
or at least an IP-like protocol, is what is needed. The `feature' of ATM
that made it suitable for multimedia was reservation, but yet again IP has
won the day by providing support for streaming via RSVP and differential
services. The power of the new reservation functionality within IP is
significantly better than that offered within ATM as it can provide a
degree of fault tolerance through the use of soft-state; it can no longer
even be argued that this is simply an add-on as IPv6 has the flow label and
type-of-service fields as a fundamental part of the header. (0 Refs)
Copyright 1998, IEE
5938844 INSPEC Abstract Number: B9807-6210L-106, C9807-5620W-067
Title: QoS path management with RSVP
Author(s): Guerin, R.A.; Kamat, S.; Herzog, S.
Author Affiliation: IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA
Conference Title: GLOBECOM 97. IEEE Global Telecommunications Conference.
Conference Record (Cat. No.97CH36125) Part vol.3 p.1914-18 vol.3
Publisher: IEEE, New York, NY, USA
Publication Date: 1997 Country of Publication: USA 3 vol. xxvii+1962
pp.
ISBN: 0 7803 4198 8 Material Identity Number: XX97-02850
U.S. Copyright Clearance Center Code: 0 7803 4198 8/97/$10.00
Conference Title: GLOBECOM 97. IEEE Global Telecommunications Conference.
Conference Record
Conference Sponsor: Bull Worldwide Inf. Syst
Conference Date: 3-8 Nov. 1997 Conference Location: Phoenix, AZ, USA
Language: English Document Type: Conference Paper (PA)
Treatment: Theoretical (T)
Abstract: This paper addresses the issue of QoS path management in IP
networks. We describe a proposal aimed at allowing management through the
RSVP (Braden et al. 1966) protocol of oaths selected by a QoS routing
algorithm such as those of Guerin et al. (1997) and Zhang et al. (1996).
The goals of the proposal are to allow efficient management of such QoS
paths with a minimal impact to the RSVP protocol and the existing routing
infrastructure. Basic features of the approach include leveraging of RSVP
soft state mechanisms, and simple extensions to enable soft pinning
(sticking) of paths selected by the QoS routing algorithm. In addition, the
proposal addresses the issue of preventing the formation of data path
loops, and of avoiding potential race conditions. (6 Refs)
Copyright 1998, IEE
5815807 INSPEC Abstract Number: B9803-6250F-027
Title: Shared tree wireless network multicast
Author(s): Ching-Chuan Chiang; Gerla, M.; Lixia Zhang
Author Affiliation: Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA
Conference Title: Proceedings. Sixth International Conference on Computer
Communications and Networks (Cat. No.97TB100187) p.28-33
Editor(s): Makki, K.; Ni, L.M.; Singhal, M.; Pissinou, N.
Publisher: IEEE Comput. Soc, Los Alamitos, CA, USA
Publication Date: 1997 Country of Publication: USA xviii+551 pp.
ISBN: 0 8186 8186 1 Material Identity Number: XX97-02203
U.S. Copyright Clearance Center Code: 1095-2055/97/$10.00
Conference Title: Proceedings of Sixth International Conference on
Computer Communications and Networks
Conference Sponsor: DataTech; NASA; IEEE Commun. Soc.; NSF; NIST; Center
for Telecommun. Studies at Univ. Southwestern Louisana
Conference Date: 22-25 Sept. 1997 Conference Location: Las Vegas, NV,
USA
Language: English Document Type: Conference Paper (PA)
Treatment: Practical (P)
Abstract: In this paper we propose a multicast protocol for a multihop,
mobile wireless network with cluster based routing and token access
protocol within each cluster. The multicast protocol uses a shared tree
which is dynamically updated to adjust to changes in topology and
membership (i.e. dynamic joins and quits). Two options for tree maintenance
have been simulated and evaluated: "hard state" (i.e. each connection must
be explicitly cleared) and "soft state" (each connection is automatically
timed out and must be refreshed). For the soft state policy, the
performance of different choices of timeout and refresh timers is first
analyzed for a range of node mobility values. Next, soft state and hard
state policies are compared based on throughput, join delay, and control
overhead criteria. (15 Refs)
Copyright 1998, IEE
4526989 INSPEC Abstract Number: B9401-6150M-004, C9401-5640-005
Title: RSVP: a new resource ReSerVation Protocol
Author(s): Zhang, L.; Deering, S.; Estrin, D.; Shenker, S.; Zappala, D.
Author Affiliation: Xerox PARC, Palo Alto, CA, USA
Journal: IEEE Network vol.7, no.5 p.8-18
Publication Date: Sept. 1993 Country of Publication: USA
CODEN: IENEET ISSN: 0890-8044
U.S. Copyright Clearance Center Code: 0890-8044/93/$03.00
Language: English Document Type: Journal Paper (JP)
Treatment: Practical (P)
Abstract: A resource reservation protocol (RSVP), a flexible and scalable
receiver-oriented simplex protocol, is described. RSVP provides
receiver-initiated reservations to accommodate heterogeneity among
receivers as well as dynamic membership changes; separates the filters from
the reservation, thus allowing channel changing behavior; supports a
dynamic and robust multipoint-to-multipoint communication model by taking a
soft-state approach in maintaining resource reservations; and decouples the
reservation and routing functions. A simple network configuration with five
hosts connected by seven point-to-point links and three switches is
presented to illustrate how RSVP works. Related work and unresolved issues
are discussed. (18 Refs)